Discrete and fuzzy dynamical genetic programming in the XCSF learning classifier system

A number of representation schemes have been presented for use within learning classifier systems, ranging from binary encodings to neural networks. This paper presents results from an investigation into using discrete and fuzzy dynamical system representations within the XCSF learning classifier system. In particular, asynchronous random Boolean networks are used to represent the traditional condition-action production system rules in the discrete case and asynchronous fuzzy logic networks in the continuous-valued case. It is shown possible to use self-adaptive, open-ended evolution to design an ensemble of such dynamical systems within XCSF to solve a number of well-known test problems

Simulation techniques in energy analysis

Simulation is one of the most frequently used techniques in energy modelling. After some general remarks on the nature of simulation models, a more detailed description of a large scale dynamic energy simulation model for the Federal Republic of Germany is given. The paper continues with a discussion of some model results and concludes with some brief remarks on the limitations of the simulation approach

Poliomyelitis surveillance report number 18, May 20, 1955

Dr. Edwin Lennette, Virus Laboratory, California Department of Public Health, reports isolation of type 1 virus from the stool of case PSU No. Cal-21. He also reports isolation of type 1 virus from the stool of a third \uc2\ub0th contact of non-paralytic case PSU No. Cal-14. Isolations from 2 other contacts of this case were previously reported.Dr. Werner Henle, Children\ue2\u20ac\u2122s Hospital, Philadelphia, reports isolation of type 1 poliomyelitis virus from Case PSU No. Pa-2. This is the first isolation from a case receiving Wyeth Vaccine. This case had first paralysis at the same site as inoculation.One new case was accepted today from West Virginia. This seven-year-old female developed bulbar signs 26 days after inoculation with Lilly Vaccine. Vaccinated cases total 79 at 12:00 noon 5-20-55 (Table l)

Exact buffer overflow calculations for queues via martingales

Let tau(n) be the first time a queueing process like the queue length or workload exceeds a level n. For the M/M/1 queue length process, the mean Etaun and the Laplace transform Ee(-staun) is derived in closed form using a martingale introduced in Kella and Whitt (1992). For workload processes and more general systems like MAP/PH/1, we use a Markov additive extension given in Asmussen and Kella (2000) to derive sets of linear equations determining the same quantities. Numerical illustrations are presented in the framework of M/M/1 and MMPP/M/1 with an application to performance evaluation of telecommunication systems with long-range dependent properties in the packet arrival process. Different approximations that are obtained from asymptotic theory are compared with exact numerical results